On the Infinitude of Covering Systems with Least Modulus Equal to 2
ثبت نشده
چکیده
A finite set of residue classes ai (mod ni) with 1 < n1 < n2 < · · · < ns is called a covering system of congruences if every integer satisfies at least one of the congruences x ≡ai (mod ni). An example is the set {0 (mod 2), 1 (mod 3), 3 (mod 4), 5 (mod 6), 9 (mod 12)}. A covering system all of whose moduli are odd called an odd covering system is a famous unsolved conjecture of Erdös and Selfridge. In this paper, we establish that there exist infinitely many even covering systems in which the least modulus is 2 and all other moduli are even. In each such even covering system, the number of the moduli and their prime factors are determined. Moreover, we construct a covering system with nine moduli, the smallest modulus is 2, and the lcm of the moduli is divisible by only the primes 2 and 5. With the smallest modulus 2, this is an attempt in the direction of constructing covering systems none of whose moduli is a product of the prime 3.
منابع مشابه
A covering system with least modulus 25
A collection of congruences with distinct moduli, each greater than 1, such that each integer satisfies at least one of the congruences, is said to be a covering system. A famous conjecture of Erdös from 1950 states that the least modulus of a covering system can be arbitrarily large. This conjecture remains open and, in its full strength, appears at present to be unattackable. Most of the effo...
متن کاملA cross entropy algorithm for continuous covering location problem
Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...
متن کاملExact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کاملParameters Analysis of the Covering Soil of Tunnels Constructed In Liquefiable Soils
Earthquake and its catastrophic failures has been one of the disturbance worry of Civil Engineers. In geotechnical science, liquefaction is one of the most important phenomenons induced by earthquake. A change in pore water pressure follows a change in effective stress, and in a critical state in which pore water pressure equals the total stress in soil particles, soil strength is suddenly lost...
متن کاملTwo new heuristic algorithms for Covering Tour Problem
Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017